Automatikos terminų žodynas. – Vilnius: Technika. Vilius Antanas Geleževičius, Angelė Kaulakienė, Stanislovas Marcinkevičius. 2004.
Tree (data structure) — A simple unordered tree; in this diagram, the node labeled 7 has two children, labeled 2 and 6, and one parent, labeled 2. The root node, at the top, has no parent. In computer science, a tree is a widely used data structure that emulates a… … Wikipedia
Tree (graph theory) — Trees A labeled tree with 6 vertices and 5 edges Vertices v Edges v 1 Chromatic number … Wikipedia
Minimum spanning tree — The minimum spanning tree of a planar graph. Each edge is labeled with its weight, which here is roughly proportional to its length. Given a connected, undirected graph, a spanning tree of that graph is a subgraph that is a tree and connects all… … Wikipedia
Spanning tree (mathematics) — In the mathematical field of graph theory, a spanning tree T of a connected, undirected graph G is a tree composed of all the vertices and some (or perhaps all) of the edges of G . Informally, a spanning tree of G is a selection of edges of G… … Wikipedia
Degree-constrained spanning tree — In graph theory, a degree constrained spanning tree is a spanning tree where the maximum vertex degree is limited to a certain constant k. The degree constrained spanning tree problem is to determine whether a particular graph has such a spanning … Wikipedia
Minimum spanning tree-based segmentation — Contents 1 Image segmentation introduction 2 Motivation for graph based methods 3 From images to graphs 4 Minimum Spanning Tree segmentation algorithms … Wikipedia
Directed graph — A directed graph. A directed graph or digraph is a pair G = (V,A) (sometimes G = (V,E)) of:[1] a set V, whose elements are called vertices or … Wikipedia
Multitree — In combinatorics and order theoretic mathematics, a multitree may describe either of two equivalent structures: a directed acyclic graph in which the set of nodes reachable from any node form a tree, or a partially ordered set (also called a… … Wikipedia
arbre non direct — neorientuotasis medis statusas T sritis automatika atitikmenys: angl. undirected tree vok. ungerichteter Baum, m rus. неориентированное дерево, n pranc. arbre non direct, m … Automatikos terminų žodynas
neorientuotasis medis — statusas T sritis automatika atitikmenys: angl. undirected tree vok. ungerichteter Baum, m rus. неориентированное дерево, n pranc. arbre non direct, m … Automatikos terminų žodynas
